# irreducible proof

irreducible proof
несводимое доказательство

Англо-русский технический словарь.

### Смотреть что такое "irreducible proof" в других словарях:

• Distributive lattice/Proofs — Lemma 1Every totally ordered set is a distributive lattice with max as join and min as meet.ProofWe will show: : x vee (y wedge z) = (x vee y)wedge(x vee z)We may suppose yle z (If not, zle y and we may switch y and z.) Recall that yle z is… …   Wikipedia

• Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… …   Wikipedia

• Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia

• Finite field — In abstract algebra, a finite field or Galois field (so named in honor of Évariste Galois) is a field that contains only finitely many elements. Finite fields are important in number theory, algebraic geometry, Galois theory, cryptography, and… …   Wikipedia

• Character theory — This article refers to the use of the term character theory in mathematics. For the media studies definition, see Character theory (Media). In mathematics, more specifically in group theory, the character of a group representation is a function… …   Wikipedia

• Feit–Thompson theorem — In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit and John Griggs Thompson (1962, 1963) Contents 1 History 2 Significance of the proof …   Wikipedia

• Holonomy — Parallel transport on a sphere depends on the path. Transporting from A → N → B → A yields a vector different from the initial vector. This failure to return to the initial vector is measured by the holonomy of the connection. In differential… …   Wikipedia

• Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

• Intelligent design — This article is about intelligent design as promulgated by the Discovery Institute. For other uses, see Intelligent design (disambiguation). For the philosophical argument from design , see Teleological argument …   Wikipedia

• Clifford theory — For the result about curves, see Clifford s theorem on special divisors. In mathematics, Clifford theory, introduced by Clifford (1937), describes the relation between representations of a group and those of a normal subgroup. Alfred H. Clifford… …   Wikipedia

• Geometrization conjecture — Thurston s geometrization conjecture states that compact 3 manifolds can be decomposed canonically into submanifolds that have geometric structures. The geometrization conjecture is an analogue for 3 manifolds of the uniformization theorem for… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»